%0 Conference Proceedings
%4 sid.inpe.br/sibgrapi/2012/07.17.13.55
%2 sid.inpe.br/sibgrapi/2012/07.17.13.55.35
%@doi 10.1109/SIBGRAPI.2012.27
%T Memory-Efficient Order-Independent Transparency with Dynamic Fragment Buffer
%D 2012
%A Maule, Marilena,
%A Comba, João Luiz Dihl,
%A Torchelsen, Rafael,
%A Bastos, Rui,
%@affiliation UFRGS
%@affiliation UFRGS
%@affiliation UFFS
%@affiliation NVIDIA
%E Freitas, Carla Maria Dal Sasso ,
%E Sarkar, Sudeep ,
%E Scopigno, Roberto ,
%E Silva, Luciano,
%B Conference on Graphics, Patterns and Images, 25 (SIBGRAPI)
%C Ouro Preto, MG, Brazil
%8 22-25 Aug. 2012
%I IEEE Computer Society
%J Los Alamitos
%S Proceedings
%K Order-Independent Transparency.
%X Order-independent transparency (OIT) rendering is computationally intensive due to required sorting and sufficient memory to store fragments before sorting. We present Dynamic Fragment Buffer, a revamped two-pass OIT rendering technique, which performs correct blending of a large number of transparent layers at interactive frame rates. Our approach self-adjusts memory allocation to handle a variable number of fragments per pixel without wasting memory. In this paper we perform a detailed analysis of several design decisions which lead to this technique. We present a collection of experiments that illustrate the advantages of our technique with respect to others OIT algorithms in the literature.
%@language en
%3 dfb.pdf